Quantum algorithm for a set of quantum 2SAT problems*
نویسندگان
چکیده
We present a quantum adiabatic algorithm for set of 2-satisfiability (Q2SAT) problem, which is generalization (2SAT) problem. For Q2SAT we construct the Hamiltonian similar to that Heisenberg chain. All solutions given problem span subspace degenerate ground states. The adiabatically evolved so system stays in subspace. Our numerical results suggest time complexity our $O(n^{3.9})$ yielding non-trivial problems with number clauses $m=dn(n-1)/2\ (d\lesssim 0.1)$. discuss advantages over known and classical algorithms.
منابع مشابه
Linear Time Algorithm for Quantum 2SAT
A well-known result about satisfiability theory is that the 2-SAT problem can be solved in linear time, despite the NP-hardness of the 3-SAT problem. In the quantum 2-SAT problem, we are given a family of 2-qubit projectors Πi j on a system of n qubits, and the task is to decide whether the Hamiltonian H = ∑Πi j has a 0-eigenvalue, or all eigenvalues are greater than 1/nα for some α = O(1). The...
متن کاملBQIABC: A new Quantum-Inspired Artificial Bee Colony Algorithm for Binary Optimization Problems
Artificial bee colony (ABC) algorithm is a swarm intelligence optimization algorithm inspired by the intelligent behavior of honey bees when searching for food sources. The various versions of the ABC algorithm have been widely used to solve continuous and discrete optimization problems in different fields. In this paper a new binary version of the ABC algorithm inspired by quantum computing, c...
متن کاملQuantum Complexity Bounds for Independent Set Problems
We present quantum complexity lower and upper bounds for independent set problems in graphs. In particular, we give quantum algorithms for computing a maximal and a maximum independent set in a graph. We present applications of these algorithms for some graph problems. Our results improve the best classical complexity bounds for the corresponding problems.
متن کاملQuantum Algorithms for a Set of Group Theoretic Problems
We study two group theoretic problems, Group Intersection and Double Coset Membership, in the setting of black-box groups, where Double Coset Membership generalizes a set of problems, including Group Membership, Group Factorization, and Coset Intersection. No polynomial-time classical algorithms are known for these problems. We show that for solvable groups, there exist efficient quantum algori...
متن کاملDesigning a quantum genetic controller for tracking the path of quantum systems
Based on learning control methods and computational intelligence, control of quantum systems is an attractive field of study in control engineering. What is important is to establish control approach ensuring that the control process converges to achieve a given control objective and at the same time it is simple and clear. In this paper, a learning control method based on genetic quantum contr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Chinese Physics B
سال: 2021
ISSN: ['2058-3834', '1674-1056']
DOI: https://doi.org/10.1088/1674-1056/abd741